Graph Coloring Using Eigenvalue Decomposition
نویسندگان
چکیده
منابع مشابه
Coloring a Graph Using Split Decomposition
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular we present an O(nm) algorithm to compute the chromatic number for all those graphs having a split decomposition in which every prime graph is an induced subgraph of either a Ck or a Ck for some k ≥ 3.
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولGraph Coloring using CUDA
ion of computation For a graph G = (V,E), we denote the number of vertices |V| by n, the number of edges|E| by m, and the degree of a vertex vi by deg(vi). The maximum, minimum, and average degree in a graph are denoted by (delta), (sigma), and (sigma -) respectively. The minimum number of colors required to color a graph is referred to as the Chromatic number. There exists several fast sequent...
متن کاملParallel Graph Coloring Using Java
In this paper a parallel, pipeline oriented version of a well-known sequential graph coloring heuristic is introduced. Runtime and speedup results of an implementation in JAVA on a four processor machine are presented and discussed.
متن کاملExact Graph Coloring for Functional Decomposition: Do We Need It?
| Finding column multiplicity index is one of important component processes in functional decomposition of discrete functions for circuit design and especially Data Mining applications. How important it is to solve this problem exactly from the point of view of the minimum complexity of decomposition, and related to it error in Machine Learning type of applications? In order to investigate this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Algebraic Discrete Methods
سال: 1984
ISSN: 0196-5212,2168-345X
DOI: 10.1137/0605051